A General Framework for One Database Private Information Retrieval
نویسنده
چکیده
In this paper we present and analyze a general scheme for one database computationally Private Information Retrieval. This scheme was first presented by Ostrovsky and Skeith in [13]. This general framework shows such a PIR scheme based on any secure homomorphic public key encryption scheme. We complete the analysis of this framework, present a proof of security, and do a careful analysis of the communication and computation complexity.
منابع مشابه
Private Information Retrieval from Coded Databases with Colluding Servers
We present a general framework for Private Information Retrieval (PIR) from arbitrary coded databases, that allows one to adjust the rate of the scheme to the suspected number of colluding servers. If the storage code is a generalized Reed-Solomon code of length n and dimension k, we design PIR schemes that achieve a PIR rate of n−(k+t−1) n while protecting against any t colluding servers, for ...
متن کاملImage Retrieval Using Dynamic Weighting of Compressed High Level Features Framework with LER Matrix
In this article, a fabulous method for database retrieval is proposed. The multi-resolution modified wavelet transform for each of image is computed and the standard deviation and average are utilized as the textural features. Then, the proposed modified bit-based color histogram and edge detectors were utilized to define the high level features. A feedback-based dynamic weighting of shap...
متن کاملAn Authorization Framework for Database Systems
Today, data plays an essential role in all levels of human life, from personal cell phones to medical, educational, military and government agencies. In such circumstances, the rate of cyber-attacks is also increasing. According to official reports, data breaches exposed 4.1 billion records in the first half of 2019. An information system consists of several components, which one of the most im...
متن کاملA general private information retrieval scheme for MDS coded databases with colluding servers
The problem of private information retrieval gets renewed attentions in recent years due to its information-theoretic reformulation and applications in distributed storage systems. PIR capacity is the maximal number of bits privately retrieved per one bit of downloaded bit. The capacity has been fully solved for some degenerating cases. For a general case where the database is both coded and co...
متن کاملOne-way Trapdoor Permutations Are Suucient for Non-trivial Single-server Private Information Retrieval
We show that general one-way trapdoor permutations are suucient to privately retrieve an entry from a database of size n with total communication complexity strictly less than n. More speciically, we present a protocol in which the user sends O(K 2) bits and the server sends n ? cn K bits (for any constant c), where K is the security parameter of the trapdoor permutations. Thus, for suuciently ...
متن کامل